Broadcasting in random graphs
نویسندگان
چکیده
منابع مشابه
Broadcasting in Random Graphs
We do a probabilistic analysis of the problem of distributing a single piece of information to the vertices of a graph G. Assuming that the input graph G is Gn,p, we prove an O(lnn/n) upper bound on the edge density needed so that with high probability the information can be broadcast in ⌈log2 n⌉ rounds.
متن کاملOn Radio Broadcasting in Random Geometric Graphs
One of the most frequently studied problems in the context of information dissemination in communication networks is the broadcasting problem. In this paper we consider radio broadcasting in random geometric graphs, in which n nodes are placed uniformly at random in [0, √ n], and there is a (directed) edge from a node u to a node v in the corresponding graph iff the distance between u and v is ...
متن کاملBroadcasting in planar graphs
For an arbitrary graph on n vertices, the minimum time required to broadcast is pogz n 1, and for any n, there exist graphs on n vertices with broadcast time equal to fIogz n 1. When restricted to planar graphs, this is generally not the case; however, just one additional time unit is sufficient to allow broadcasting in certain planar graphs. We also show that the maximum number of vertices in ...
متن کاملBroadcasting in Bounded Degree Graphs
Broadcasting is an information dissemination process in which a message is to be sent from a single originator to all members of a network by placing calls over the communication lines of the network. Several previous papers have investigated methods to construct sparse graphs (networks) in which this process can be completed in minimum time from any originator. The graphs produced by these met...
متن کاملBroadcasting on cactus graphs
Broadcasting is the process of dissemination of a message from one vertex (called originator) to all other vertices in the graph. This task is accomplished by placing a sequence of calls between neighboring vertices, where one call requires one unit of time and each call involves exactly two vertices. Each vertex can participate in one call per one unit of time. Determination of the broadcast t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1994
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00033-6